Poly-antimatroid polyhedra
نویسندگان
چکیده
منابع مشابه
Uniform Antimatroid Closure Spaces
Often the structure of discrete sets can be described in terms of a closure operator. When each closed set has a unique minimal generating set (as in convex geometries in which the extreme points of a convex set generate the closed set), we have an antimatroid closure space. In this paper, we show there exist antimatroid closure spaces of any size, of which convex geometries are only a sub-fami...
متن کاملTransformations of Antimatroid Closure Spaces
Investigation of the transformations of vector spaces, whose most abstract formulations are called matroids, is basic in mathematics; but transformations of discrete spaces have received relatively little attention. This paper develops the concept of transformations of discrete spaces in the context of antimatroid closure spaces. The nature of these transformations are quite diierent from those...
متن کاملCorrespondence between two Antimatroid Algorithmic Characterizations
The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great importance. While antimatroids can also be characterized as set systems, the question whether there is an algorithmic description of antimatroids in terms of sets and set functions was open for some period of time. This ...
متن کاملJordan Surfaces in Discrete Antimatroid Topologies
In this paper we develop a discrete, T0 topology in which (1) closed sets play a more prominent role than open sets, (2) atoms comprising the space have discrete dimension, which (3) is used to define boundary elements, and (4) configurations within the topology can have connectivity (or separation) of different degrees. To justify this discrete, closure based topological approach we use it to ...
متن کاملGeneralized Semi-Markov Processes: Antimatroid Structure and Second-Order Properties
A generalized semi-Markou scheme models the structure of a discrete event system, such as a network of queues. By studying combinatorial and geometric representations of schemes we find conditions for second-order properties-convexity/concavity, sub/supermodularity-of their event epochs and event counting processes. A scheme generates a language of feasible strings of events. We show that monot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2013
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.263.eb4